leaf node
英 [liːf nəʊd]
美 [liːf noʊd]
网络 叶子结点; 叶子节点; 叶节点; 叶结点; 树叶节点
英英释义
noun
- (botany) the small swelling that is the part of a plant stem from which one or more leaves emerge
双语例句
- This framework is of layered and distributed structure, including a central control node layer, a convergent node layer and a leaf node layer.
该框架是分层分布式结构，由中央控制节点层、汇聚节点层和叶节点层构成。 - In the index tree, leaf node is storing the XML data.
索引树中的叶子节点存放着XML节点的数据。 - In the document map, all of the text describing the books is stored in leaf elements; the text itself is the leaf node.
在文档映射中，介绍书籍的所有文本存储在叶元素中；文本本身就是叶节点。 - Compared to traditional method, the improved method adds the leaf node path distance measurement, making the measure of sample similarity more precise.
与原始方法相比，改进方法增加了叶子节点路径距离的度量，更精确地度量了样本间的相似性。 - Compared with Judy, J#-tree adds a precursor pointer and a successor pointer into every leaf node, pointing to the precursor node and the successor node, respectively.
与Judy相比，J树通过在叶结点中增加一个前驱指针和一个后继指针，分别指向该结点的前驱结点和后继结点。 - Based on faceted classification schema and theory of tree mapping, a novel matching model named leaf node containment matching model and correspondence retrieving algorithm are put forward.
在分析了构件刻面分类模式和树映射相关理论的基础上，提出了一个新颖的叶节点包容匹配模型，并给出了相应的检索算法。 - It proposes a hybrid approach for regression analysis& BRT ( Bayesian regression tree), which builds tree model by the divide-and-conquer method and uses NBR ( naive Bayesian network for regression) to replace leaf node.
结合朴素贝叶斯和决策树提出一种用于回归分析的混合学习方法&BRT（BayesianRegressionTree）。该方法基于分而治之原则构造决策树，以朴素贝叶斯取代叶节点。 - Manilagrass was trampled by 4 trampling intensities in 3 courses. The internode length, the leaf length and the number of node will increase as the trampling intensities become stronger.
草坪草的茎节数、节间长度、叶片长度均是随践踏强度的增加而减少，重度践踏胁迫下，分别比对照减少20.1%、26.9%和33.4%。 - A geo-based search tree with branching factor K is constructed by recursively using cluster method to split scenes. The atomic region is defined on the leaf node of the search tree.
通过聚类算法递归的建立了一棵K叉树，将场景划分为由树的叶节点定义的若干原子区域。 - The third is all attributes from rote node to leaf node must be known.
ID3必须知道从叶子节点到树根的路径上所有内节点对应的属性的属性值。